Interval Constraint Plotting for Interactive

Conventional plotting programs adopt techniques such as adaptive sampling to approximate , but not to guarantee, correctness and completeness in graphing functions. Moreover, implicitly deened mathematical relations can impose an even greater challenge as they either cannot be plotted directly, or otherwise are likely to be misrepresented. In this paper, we address these problems by investigating interval constraint plotting as an alternative approach that plots a hull of the speciied curve. We present some empirical evidence that this hull property can be achieved by a O(n) algorithm. Practical experience shows that the hull obtained is the narrowest possible whenever the precision of the underlying oating-point arithmetic is adequate. We describe IASolver, a Java applet 9], that serves as testbed for this idea.